منابع مشابه
A Testing Read-Once Formula Satisfaction
We study the query complexity of testing for properties defined by read once formulas, as instances of massively parametrized properties, and prove several testability and non-testability results. First we prove the testability of any property accepted by a Boolean read-once formula involving any bounded arity gates, with a number of queries exponential in , doubly exponential in the arity, and...
متن کاملTesting Monotone Read-Once Functions
A checking test for a monotone read-once function f depending essentially on all its n variables is a set of vectors M distinguishing f from all other monotone read-once functions of the same variables. We describe an inductive procedure for obtaining individual lower and upper bounds on the minimal number of vectors T (f) in a checking test for any function f . The task of deriving the exact v...
متن کاملTesting Formula Satisfaction
We study the query complexity of testing for properties defined by read once formulas, as instances of massively parametrized properties, and prove several testability and non-testability results. First we prove the testability of any property accepted by a Boolean read-once formula involving any bounded arity gates, with a number of queries exponential in ǫ, doubly exponential in the arity, an...
متن کاملIsomorphism testing of read-once functions and polynomials
In this paper, we study the isomorphism testing problem of formulas in the Boolean and arithmetic settings. We show that isomorphism testing of Boolean formulas in which a variable is read at most once (known as read-once formulas) is complete for log-space. In contrast, we observe that the problem becomes polynomial time equivalent to the graph isomorphism problem, when the input formulas can ...
متن کاملOn Reconstruction and Testing of Read-Once Formulas
An arithmetic read-once formula (ROF for short) is a formula (a circuit whose underlying graph is a tree) in which the operations are {+,×} and each input variable labels at most one leaf. A preprocessed ROF (PROF for short) is a ROF in which we are allowed to replace each variable xi with a univariate polynomial Ti(xi). We obtain a deterministic non-adaptive reconstruction algorithm for PROFs,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computation Theory
سال: 2016
ISSN: 1942-3454,1942-3462
DOI: 10.1145/2897184